N values are updated, I want to know the minimum value.

There are N values and they are being updated, I want to know the minimum value.

→ Queue a tuple of which value was updated to what and when. Store the last modified time of the value in an array of size N. Skip information that is not up-to-date when retrieving.

code:python

N = 2

queue = []

time = 0

def update(pos, value):

global time

time += 1

heappush(queue, (value, pos, time))

def top():

while queue:

return value

heappop(queue)

return None

update(0, 42)

print(top()) # => 42

update(1, 43)

print(top()) # => 42

update(0, 44)

print(top()) # => 43

---